Kinetic growth walks on complex networks
نویسندگان
چکیده
منابع مشابه
Random walks on complex networks.
We investigate random walks on complex networks and derive an exact expression for the mean first-passage time (MFPT) between two nodes. We introduce for each node the random walk centrality C, which is the ratio between its coordination number and a characteristic relaxation time, and show that it determines essentially the MFPT. The centrality of a node determines the relative speed by which ...
متن کاملLong-Range Navigation on Complex Networks using Lévy Random Walks
We introduce a strategy of navigation in undirected networks, including regular, random, and complex networks, that is inspired by Lévy random walks, generalizing previous navigation rules. We obtained exact expressions for the stationary probability distribution, the occupation probability, the mean first passage time, and the average time to reach a node on the network. We found that the long...
متن کاملSearching method through biased random walks on complex networks.
Information search is closely related to the first-passage property of diffusing particle. The physical properties of diffusing particle is affected by the topological structure of the underlying network. Thus, the interplay between dynamical process and network topology is important to study information search on complex networks. Designing an efficient method has been one of main interests in...
متن کاملStructured thalamocortical connectivity revealed by random walks on complex networks
The segregated regions of the mammalian cerebral cortex and thalamus form an extensive and complex network, whose structure and function are still only incompletely understood. The present article describes an application of the concepts of complex networks and random walks that allows the identification of non-random, highly structured features of thalamocortical connections, and their potenti...
متن کاملMaps of random walks on complex networks reveal community structure.
To comprehend the multipartite organization of large-scale biological and social systems, we introduce an information theoretic approach that reveals community structure in weighted and directed networks. We use the probability flow of random walks on a network as a proxy for information flows in the real system and decompose the network into modules by compressing a description of the probabil...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics A: Mathematical and General
سال: 2005
ISSN: 0305-4470,1361-6447
DOI: 10.1088/0305-4470/38/20/004